REENTERABLE MODEL OF RIP PROTOCOL IN COLORED PETRI NETS FORM

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards Reusable Colored Petri Nets

Reuse has long been recognized as a key technology that can bring about signi cant productivity gains in software development. Code-level reuse is wellunderstood and frequently practiced. However, reuse in software requirements, another phase where much bene t can be expected, remains inadequately addressed. Hierarchical Colored Petri Net (HCPN) formalism has been successfully used on several l...

متن کامل

Extended Simple Colored Petri Nets

We present a new class of Petri Nets, called Extended Simple Colored Petri Nets (ESCP-nets), which are essentially Simple Colored Petri Nets (SCP-nets) with three added features: first, there is a built-in type of real numbers; second, tokens can be forced to wait in places; third, an interface specifies how the Net can be externally supervised. Even if these added features also add complexity,...

متن کامل

Timed Colored Petri Nets Based

Abstract: Aero-engines maintenance procedure can be treated as a typical discrete event dynamic system. A theory that synthesized timed colored Petri net is proposed. The theory adopts a bottom-up approach by merging all sub modules, and each one characterizes the critical resource contention among processes. Nevertheless Petri net seems inapplicable to dynamic scheduling modelling because of i...

متن کامل

Syntactical Colored Petri Nets Reductions

In this paper, we develop a syntactical version of elaborated reductions for high-level Petri nets. These reductions simplify the model by merging some sequential transitions into an atomic one. Their conditions combine local structural ones (e.g. related to the actions of a thread) and global algebraic ones (e.g. related to the threads synchronization). We show that these conditions are perfor...

متن کامل

Throughput analysis in timed colored Petri nets

It is shown that the steady-state behavior of a class of timed colored Petri nets can be analyzed using the concept of throughput and simple rules of operational analysis. Since such analysis is based on the average values of firing times rather than firing time distribution functions, the same approach ca be applied to a variety of net models. Throughput analysis is based on S t N C t U d prop...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Radio Electronics, Computer Science, Control

سال: 2017

ISSN: 2313-688X,1607-3274

DOI: 10.15588/1607-3274-2016-4-12